Stochastic Recovery Of Sparse Signals From Random Measurements
نویسنده
چکیده
Sparse signal recovery from a small number of random measurements is a well known NP-hard to solve combinatorial optimization problem, with important applications in signal and image processing. The standard approach to the sparse signal recovery problem is based on the basis pursuit method. This approach requires the solution of a large convex optimization problem, and therefore suffers from high computational complexity. Here, we discuss a stochastic optimization method, as a low-complexity alternative to the basis pursuit approach.
منابع مشابه
Analysis $\ell_1$-recovery with frames and Gaussian measurements
This paper provides novel results for the recovery of signals from undersampled measurements based on analysis `1-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery guarantees for cosparse (analysissparse) signals using Gaussian random measurement matrices. The nonuniform result relies on a recovery condition via tangent cones...
متن کاملAnalysis ℓ1-recovery with frames and Gaussian measurements
This paper provides novel results for the recovery of signals from undersampled measurements based on analysis `1-minimization, when the analysis operator is given by a frame. We both provide so-called uniform and nonuniform recovery guarantees for cosparse (analysissparse) signals using Gaussian random measurement matrices. The nonuniform result relies on a recovery condition via tangent cones...
متن کاملRecovery of Clustered Sparse Signals from Compressive Measurements
We introduce a new signal model, called (K,C)-sparse, to capture K-sparse signals in N dimensions whose nonzero coefficients are contained within at most C clusters, with C < K ≪ N . In contrast to the existing work in the sparse approximation and compressive sensing literature on block sparsity, no prior knowledge of the locations and sizes of the clusters is assumed. We prove that O (K + C lo...
متن کاملStochastic Filtering via Reweighted-`1
Many modern signal processing applications can be stated in terms of performing inference on sparse signals that have significant dependencies between those signals. Consider the task of recovering signals xn ∈ R from incomplete and noisy linear measurements yn = Φnxn + n, where Φn ∈ RM×N is the potentially timevarying measurement matrix, n is the measurement noise, and n ∈ K is an index (e.g.,...
متن کاملChirp Sensing Codes: Deterministic Compressed Sensing Measurements for Fast Recovery
Compressed sensing is a novel technique to acquire sparse signals with few measurements. Normally, compressed sensing uses random projections as measurements. Here we design deterministic measurements and an algorithm to accomplish signal recovery with computational efficiently. A measurement matrix is designed with chirp sequences forming the columns. Chirps are used since an efficient method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.2058 شماره
صفحات -
تاریخ انتشار 2010